Boolean Functions: Cryptography and Applications
نویسندگان
چکیده
In this paper theoretical aspects of multidimensional linear distinguishing attacks are investigated. Using known examples of highly nonlinear Boolean functions we demonstrate how multidimensional linear approximations offer significant reduction in data complexity in distinguishing attacks. We also get concrete examples where one-dimensional linear approximations are never statistically independent.
منابع مشابه
ON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کاملA construction of binary linear codes from Boolean functions
Boolean functions have important applications in cryptography and coding theory. Two famous classes of binary codes derived from Boolean functions are the Reed-Muller codes and Kerdock codes. In the past two decades, a lot of progress on the study of applications of Boolean functions in coding theory has been made. Two generic constructions of binary linear codes with Boolean functions have bee...
متن کاملBoolean Functions: Cryptography and Applications
I recall some properties of the distribution for the nonlinearity of Boolean functions, and I introduce new ones which are related to large deviation theorems in probability.
متن کاملApplications of Boolean Functions in Cryptography
Nonlinear Boolean functions are considered for a long time to construct symmetric cryptosystems. In order to resist the known attacks, many properties of Boolean functions must be utilized. In this paper we analyze some major properties according to different attacks and list some research topics. We also analyze the performance of the S-box in classical algorithms such as DES and AES, and the ...
متن کاملOn Cryptographic Properties of Random Boolean Functions
Boolean functions used in cryptographic applications have to satisfy various cryptographic criteria. Although the choice of the criteria depends on the cryptosystem in which they are used, there are some properties (balancedness, nonlinearity, high algebraic degree, correlation immunity, propagation criteria) which a cryptographically strong Boolean function ought to have. We study the above me...
متن کامل